Thumbnail Rectilinear Steiner Trees - VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on
نویسندگان
چکیده
The rectilinear Steiner tree problem i s t o find a manimum-length set of horizontal and vertical line segments that interconnect a given set of points in $he plane. Here we study the thumbnail rectilinear S te iner tree problem, where the inpvt points are drawn f r o m a small integer grid. Specifically, we devise a full-set decomposition algorithm for computing opt ima l thumbnail rectalinear Steiner trees. W e then present experimental results comparing this algorithm with t w o existing algorithms for computing optimal recdilinear Steiner trees. T h e thumbnail rectilinear Steiner tree problem has applications in VLSI placement algorithms based on geometric parti t ioning and i n global routing of field-programmable gate arrays.
منابع مشابه
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees
An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets1
We present an eecient algorithm to compute an optimal rectilinear Steiner tree for extremal point sets. A point set is extremal if every point in it lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used to construct minimum-length connection for multi-terminal nets in homotopic routing in VLSI layout design. The previous best algorithms run in O(k 4 n) ti...
متن کاملToward a Steiner engine: enhanced serial and parallel implementations of the iterated 1-Steiner MRST algorithm
The minimum rectilinear Steiner tree (MRST) problem arises in global routing and wiring estimation, as well as in many other areas. The MRST problem is known to be NP-hard, and the best performing MRST heuristic to date is the Iterated 1-Steiner f"":' method recently proposed b y Kahng and Robins 1.91 I1S achieves significantly improved average-case performance while avoiding the worst-case exa...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.
متن کامل